package com.company.笔试.两个链表的第一个公共节点;

import com.company.笔试.ListNode;

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
        ListNode p1 = pHead1;
        ListNode p2 = pHead2;
        while(p1!=p2){
            p1 = p1==null?pHead1:p1.next;
            p2 = p2==null?pHead2:p2.next;
        }
        return p1;
    }
}